An Optimal Cooling Schedule Using a Simulated Annealing Based Approach
نویسندگان
چکیده
منابع مشابه
An Efficient Simulated Annealing Schedule
The popularity of simulated annealing comes from its ability to find close to optimal solutions for NPhard combinatorial optimization problems. Unfortunately, the method has a major drawback: its massive requirement of computation time. In this dissertation, we present an efficient annealing schedule which speeds up simulated annealing by a factor of up to twenty-four when compared with general...
متن کاملSimulated Annealing: Searching for an Optimal Temperature Schedule
A sizable part of the theoretical literature on simulated annealing deals with a property called convergence, which asserts that the simulated annealing chain is in the set of global minimum states of the objective function with probability tending to 1. However, in practice, the convergent algorithms are considered too slow, whereas a number of nonconvergent ones are usually preferred. We atte...
متن کاملAn Efficient Simulated Annealing Schedule: Derivation
The popularity of simulated annealing comes from its ability to find close to optimal solutions for NP-hard combinatorial optimization problems. Unfortunately, current implementations of the method usually require massive computation time. This paper presents a general annealing schedule which speeds up simulated annealing significantly when compared with general schedules available in the lite...
متن کاملOptimal vaccination schedules using simulated annealing
SUMMARY Since few years the problem of finding optimal solutions for drug or vaccine protocols have been tackled using system biology modeling. These approaches are usually computationally expensive. Our previous experiences in optimizing vaccine or drug protocols using genetic algorithms required the use of a high performance computing infrastructure for a couple of days. In the present articl...
متن کاملAn Efficient Simulated Annealing Schedule: Implementation and Evaluation
We present an implementation of an efficient general simulated annealing schedule and demonstrate experimentally that the new schedule achieves speedups often exceeding an order of magnitude when compared with other general schedules currently available in the literature. To assess the performance of simulated annealing as a general method for solving combinatorial optimization problems, we als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2017
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2017.88090